#include <stdio.h>
#include <math.h>

int prime(int p);
void Goldbach(int n);

int main()
{
    int m, n, i, cnt;

    scanf("%d %d", &m, &n);
    if (prime(m) != 0)
        printf("%d is a prime number\n", m);
    if (m < 6)
        m = 6;
    if (m % 2)
        m++;
    cnt = 0;
    for (i = m; i <= n; i += 2)
    {
        Goldbach(i);
        cnt++;
        if (cnt % 5)
            printf(", ");
        else
            printf("\n");
    }

    return 0;
}

/* 你的代码将被嵌在这里 */

int prime(int p)
{
    int flag = 0;
    if (p == 1)
        return 0;
    if (p == 2)
        return 1;
    for (int i = 2; i < p; i++)
    {
        if (p % i == 0)
            flag = 1;
    }
    if (flag == 0)
        return 1;
    else
        return 0;
};
void Goldbach(int n)
{
    int flag = 0;
    for (int i = 3; i < n; i += 2)
    {
        for (int j = 3; j < n; j += 2)
        {
            if (n == i + j)
            {
                if (prime(i) && prime(j))
                {
                    printf("%d=%d+%d", n, i, j);
                    flag = 1;
                }
            }
        }
        if (flag == 1)
            break;
    }
};
